A Localization Method Avoiding Flip Ambiguities for Micro-UAVs with Bounded Distance Measurement Errors

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Avoiding the Flip Ambiguities in 2D Wireless Sensor Localization by Using Unit Disk Graph Property

In this paper, we propose a range-based localization algorithm to localize a wireless sensor network (WSN) in 2D. A widely used algorithm to localize a WSN in 2D is trilateration, which runs in polynomial time. Trilateration uses three distance measurements to localize a node. In some cases, the lack of connectivity leads to a low percentage of localized nodes since a node’s position can be fix...

متن کامل

Avoiding interpretation ambiguities with phonetic cues∗

In spite of the noise, you’re able to understand what you think your sister is trying to tell you: that she wants to get another cat (i.e. you interpret her utterance as I want to give my cat a friend). However, when you then ask her what breed she wants to get, she is confused, because she has decided that she can’t manage owning a cat; what she actually said was I want to give my cat to a fri...

متن کامل

A Recursive Method for Calculating Error Probabilities for a Reed-solomon Codeword with Bounded Distance Errors and Erasures Decoding

This paper is the second in a series of two papers dealing with methods for recursively calculating codeword error and erasure probabilities for Reed-So!ornon (RS) codewords. As with the previous paper [1], a single RS codeword is transmitted in a channel where each transmitted symbol experiences independent identically distributed (IID) noise or a channel where each symbol experiences independ...

متن کامل

Querying Shortest Path Distance with Bounded Errors in Large Graphs

Shortest paths and shortest path distances are important primary queries for users to query in a large graph. In this paper, we propose a new approach to answer shortest path and shortest path distance queries efficiently with an error bound. The error bound is controlled by a user-specified parameter, and the online query efficiency is achieved with prepossessing offline. In the offline prepro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Mobile Computing

سال: 2019

ISSN: 1536-1233,1558-0660,2161-9875

DOI: 10.1109/tmc.2018.2865462